A parallel hybrid banded system solver: the SPIKE algorithm

نویسندگان

  • Eric Polizzi
  • Ahmed H. Sameh
چکیده

This paper describes an efficient and robust hybrid parallel solver ‘‘the SPIKE algorithm’’ for narrow-banded linear systems. Two versions of SPIKE with their built-in-options are described in detail: the Recursive SPIKE version for handling non-diagonally dominant systems and the Truncated SPIKE version for diagonally dominant ones. These SPIKE schemes can be used either as direct solvers, or as preconditioners for outer iterative schemes. Both versions are faster than the direct solvers in ScaLAPACK on parallel computing platforms, and quite competitive in terms of achieved accuracy for handling systems that are dense within the band. 2005 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On some parallel banded system solvers

We consider algorithms for solving narrow-banded diagonally dominant linear systems which are suitable for multiprocessors. We describe a direct solver similar to that in [12] for tridiagonal systems, and in [9] for solving a banded system on a linearly connected set of processors. We will also provide and analyze a parallel implementation of the partitioning algorithm and the matrix decomposit...

متن کامل

Analysis of the Truncated SPIKE Algorithm

The truncated SPIKE algorithm is a parallel solver for linear systems which are banded and strictly diagonally dominant by rows. There are machines for which the current implementation of the algorithm is faster and scales better than the corresponding solver in ScaLAPACK (PDDBTRF/PDDBTRS). In this paper we prove that the SPIKE matrix is strictly diagonally dominant by rows with a degree no les...

متن کامل

On Experiments with a Parallel Direct Solver for Diagonally Dominant Banded Linear Systems

We report on numerical experiments that we conducted with a direct algorithm, the single width sparator algorithm, to solve diagonally dominant banded linear systems. With detailed estimations of computation and communication cost we quantitatively analyze their innuence on the parallel performance of the algorithm. We report on numerical experiments executed on an Intel Paragon XP/S-22MP.

متن کامل

PSPIKE: A Parallel Hybrid Sparse Linear System Solver

The availability of large-scale computing platforms comprised of tens of thousands of multicore processors motivates the need for the next generation of highly scalable sparse linear system solvers. These solvers must optimize parallel performance, processor (serial) performance, as well as memory requirements, while being robust across broad classes of applications and systems. In this paper, ...

متن کامل

Special Issue on the 9th International Symposium on Parallel and Distributed Computing

Welcome to this special issue on the ninth edition of International Symposium on Parallel and Distributed Computing (ISPDC) held in Istanbul in July 2010. ISPDC is dedicated to the advancement of state-of-theart in the area of parallel and distributed computing. The symposium program featured 28 full papers accepted out of 71 submitted papers. The program covered a wide spectrum of topics inclu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Parallel Computing

دوره 32  شماره 

صفحات  -

تاریخ انتشار 2006